Direction finding by complex L1-principal-component analysis
نویسندگان
چکیده
In the light of recent developments in optimal real L1-norm principal-component analysis (PCA), we provide the first algorithm in the literature to carry out L1-PCA of complexvalued data. Then, we use this algorithm to develop a novel subspace-based direction-of-arrival (DoA) estimation method that is resistant to faulty measurements or jamming. As demonstrated by numerical experiments, the proposed algorithm is as effective as state-of-the-art L2-norm methods in clean-data environments and significantly superior when operating on corrupted data. Keywords—Antenna arrays, data contamination, direction of arrival estimation, L1-norm, principal-component analysis.
منابع مشابه
Development of a cell formation heuristic by considering realistic data using principal component analysis and Taguchi’s method
Over the last four decades of research, numerous cell formation algorithms have been developed and tested, still this research remains of interest to this day. Appropriate manufacturing cells formation is the first step in designing a cellular manufacturing system. In cellular manufacturing, consideration to manufacturing flexibility and productionrelated data is vital for cell formation....
متن کاملL1-norm Principal-Component Analysis of Complex Data
L1-norm Principal-Component Analysis (L1-PCA) of real-valued data has attracted significant research interest over the past decade. However, L1-PCA of complex-valued data remains to date unexplored despite the many possible applications (e.g., in communication systems). In this work, we establish theoretical and algorithmic foundations of L1-PCA of complex-valued data matrices. Specifically, we...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملFast computation of the L1-principal component of real-valued data
Recently, Markopoulos et al. [1], [2] presented an optimal algorithm that computes the L1 maximum-projection principal component of any set of N real-valued data vectors of dimension D with complexity polynomial in N , O(N). Still, moderate to high values of the data dimension D and/or data record sizeN may render the optimal algorithm unsuitable for practical implementation due to its exponent...
متن کاملOptimal Algorithms for L1-subspace Signal Processing
Abstract We describe ways to define and calculate L1-norm signal subspaces which are less sensitive to outlying data than L2-calculated subspaces. We start with the computation of the L1 maximum-projection principal component of a data matrix containing N signal samples of dimension D. We show that while the general problem is formally NP-hard in asymptotically large N , D, the case of engineer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015